Functionality Decomposition by Compositional Correstness Preserving Transformation
نویسندگان
چکیده
We present an algorithm for the decomposition of processes in a process algebraic framework. Decomposition, or the refinement of process substructure, is an important design principle in the top-down development of concurrent systems. In the approach that we follow the decomposition is based on a given partition of the actions of a system specification, such that for each partition class a subprocess must be created that realizes the actions in that class. In addition a suitable synchronization structure between the subprocesses must be present to ensure that the composite behaviour of the subprocesses is properly related to the behaviour of the original specification. We present our results for the process-algebraic specification language LOTOS and give a compositional algorithm for the transformation of the original specification into the required subprocesses. The resulting specification is observation congruent with the original, and, interestingly enough, the subprocesses inherit much of the structure of the original specification. The correctness preserving transformation has been implemented in a tool and has been used for the derivation of protocol specifications from formal descriptions of the desired service. This is possible as it can be shown that the required synchronization mechanisms between the subprocesses can be readily implemented over (reliable) asynchronous media.
منابع مشابه
A Semantic-Preserving Transformation from the Compositional Interchange Format to UPPAAL
The Compositional Interchange Format (CIF), is a modeling formalism for hybrid systems, that aims to establishing interoperability of a wide range of tools by means of model transformations to and from CIF. UPPAAL is a very successful tool for the specification and analysis of timed systems. It is interesting, both from a theoretical and a practical perspective, to be able to translate CIF mode...
متن کاملCompositional verification of model-level refactorings based on graph transformations
With the success of model-driven development as well as component-based and service-oriented systems, models of software architecture are key artifacts in the development process. To adapt to changing requirements and improve internal software quality such models have to evolve while preserving aspects of their behaviour. These behaviour preserving developments are known as refactorings. The ve...
متن کاملThe Use of Robust Factor Analysis of Compositional Geochemical Data for the Recognition of the Target Area in Khusf 1:100000 Sheet, South Khorasan, Iran
The closed nature of geochemical data has been proven in many studies. Compositional data have special properties that mean that standard statistical methods cannot be used to analyse them. These data imply a particular geometry called Aitchison geometry in the simplex space. For analysis, the dataset must first be opened by the various transformations provided. One of the most popular of the a...
متن کاملOn Infinitesimal Conformal Transformations of the Tangent Bundles with the Generalized Metric
Let be an n-dimensional Riemannian manifold, and be its tangent bundle with the lift metric. Then every infinitesimal fiber-preserving conformal transformation induces an infinitesimal homothetic transformation on . Furthermore, the correspondence gives a homomorphism of the Lie algebra of infinitesimal fiber-preserving conformal transformations on onto the Lie algebra of infinitesimal ...
متن کاملStructural decomposition
In this report we present an algorithm for the decomposition of a mono-lithic LOTOS process into two processes, which composed by the parallel operator is observational equivalent to the original one. Repeated application permits the generation of more than two processes. The algorithm is deened on labelled transition systems and, hence, its application to any process algebra with a similar not...
متن کامل